Search results for "Split-radix FFT algorithm"

showing 3 items of 3 documents

An optimized mass storage FFT for vector computers

1995

Abstract The performance of a segmented FFT algorithm which allows the out-of-core computation of the Fourier transform of a very large mass storage data array is presented. The code is particularly optimized for vector computers. Tests performed mainly on a CONVEX C210 vector computer showed that, for very long transforms, tuning of the main parameters involved leads to computation speed and global efficiency better than for FFTs performed in-core. The use of tunable parameters allows optimization of the algorithm on machines with different configurations.

Computer Networks and Communicationsbusiness.industryComputer scienceComputationFast Fourier transformPrime-factor FFT algorithmArray data typeComputer Graphics and Computer-Aided DesignTheoretical Computer ScienceVector processorsymbols.namesakeFourier transformSplit-radix FFT algorithmArtificial IntelligenceHardware and ArchitectureComputer data storagesymbolsbusinessAlgorithmSoftwareParallel Computing
researchProduct

Area-efficient FPGA-based FFT processor

2003

A novel architecture for computing the fast Fourier transform on programmable devices is presented. Main results indicate that the use of one CORDIC operator to perform the multiplication by all the ‘twiddle factors’ sequentially leads to an area saving up to 35% with respect to other cores.

Cooley–Tukey FFT algorithmSplit-radix FFT algorithmComputer sciencebusiness.industryFast Fourier transformPrime-factor FFT algorithmMultiplicationElectrical and Electronic EngineeringCORDICField-programmable gate arraybusinessTwiddle factorComputer hardwareElectronics Letters
researchProduct

Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.

1996

A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT’s in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from −1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT are discussed.

business.industryNon-uniform discrete Fourier transformMaterials Science (miscellaneous)Fast Fourier transformPrime-factor FFT algorithmShort-time Fourier transformIndustrial and Manufacturing EngineeringFractional Fourier transformDiscrete Fourier transformOpticsSplit-radix FFT algorithmRader's FFT algorithmBusiness and International ManagementbusinessAlgorithmMathematicsApplied optics
researchProduct